An Optimal Algorithm for Finding the Separation of Simple Polygons
نویسنده
چکیده
Abs t rac t . Given simple polygons P and Q, their separagion, denoted by a(P, Q), is defined to be the minimum distance between their boundaries. We present an optimal O(N) algorithm for determining the separation of two simple polygons P and Q, where [P[ § [Q[ = [N[. The best previous algorithm for this problem is due to Kirkpatrick and has complexity O(N log N). In addition, a parallel version of our algorithm can be implemented in O(logN) time using O(N) processors on a CREW PRAM. Our results are obtained by providing a unified treatment of the separation and the closest visible vertex problems for simple polygons.
منابع مشابه
Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملDetermining the separation of simple polygons
Given simple polygons P and Q, their separation, denoted by (P;Q), is de ned to be the minimum distance between their boundaries. We present a parallel algorithm for nding a closest pair among all pairs (p; q), p 2 P and q 2 Q. The algorithm runs in O(logn) time using O(n) processors on a CREW PRAM, where n = jP j + jQj. This algorithm is time-optimal and improves by a factor of O(logn) on the ...
متن کاملFinding Optimal Geodesic Bridges Between Two Simple Polygons
Given two simple polygons P and Q we study the problem of finding an optimal geodesic bridge. Our problem differs from other versions of the problem where the bridge is a Euclidean bridge. An Euclidean bridge corresponds to a straight line flyover-like bridge, where as a geodesic bridge corresponds to finding a route for a ferry boat. The objective in both of these problems is to find a bridge ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993